package num189;

/**
 * @author : DuJiabao
 * @Project : sword-finger-offer
 * @Time : 2021/5/8 18:26
 * @Desc :
 */
public class Solution2 {
  public void rotate(int[] nums, int k) {
    if (k <= 0) return;
    int length = nums.length;
    k %= length;
    int temp;
    for (int i = 0; i < k; i++) {
      for (int j = i; j < length + k; j += k) {
        int index = j % length;
        temp = nums[index];
      }
    }
  }
}
